package leetcode;

public class Leetcode705 {
    class MyHashSet {

        /** Initialize your data structure here. */
        boolean[] map = new boolean[1000005];
        public MyHashSet() {

        }

        public void add(int key) {
            map[key] = true;
        }

        public void remove(int key) {
            map[key] = false;
        }

        /** Returns true if this set contains the specified element */
        public boolean contains(int key) {
            return map[key] == true;
        }
    }


/**
 * Your MyHashSet object will be instantiated and called as such:
 * MyHashSet obj = new MyHashSet();
 * obj.add(key);
 * obj.remove(key);
 * boolean param_3 = obj.contains(key);
 */
}
